1137D - Cooperative Game - CodeForces Solution


constructive algorithms interactive number theory *2400

Please click on ads to support us..

C++ Code:

// Problem: D. Cooperative Game
// Contest: Codeforces - Codeforces Round 545 (Div. 1)
// URL: https://codeforces.com/contest/1137/problem/D
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// By : Ali Hossam

/*
 أَحَسِبَ النَّاسُ أَن يُتْرَكُوا أَن يَقُولُوا آمَنَّا وَهُمْ لَا يُفْتَنُونَ ۝ وَلَقَدْ فَتَنَّا الَّذِينَ مِن قَبْلِهِمْ فَلَيَعْلَمَنَّ اللَّهُ الَّذِينَ صَدَقُوا وَلَيَعْلَمَنَّ الْكَاذِبِينَ ۝
 */
#include <bits/stdc++.h>
#define Ali_Hossam ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
void findAim()
{
    bool flag = 1 ;
    while(flag)
    {
        cout << "next 0\n" ;
        cout.flush() ;
        int n ;
        cin >> n ;
        for(int i = 0 ; i < n ; i ++)
        {
            string s ;
            cin >> s ;
        }
        cout << "next 0 1\n" ;
        cout.flush() ;
        cin >> n ;
        if(n == 2)
            flag = 0 ;
        for(int i = 0 ; i < n ; i ++)
        {
            string s ;
            cin >> s ;
        }
    }
    return ;
}
void Ast7mo()
{
    bool flag = 1 ;
    while(flag)
    {
        cout << "next 0 1 2 3 4 5 6 7 8 9\n" ;
        cout.flush() ;
        int n ;
        cin >> n ;
        if(n == 1)
            flag = 0 ;
        for(int i = 0 ; i < n ; i ++)
        {
            string s ;
            cin >> s ;
        }
    }
    cout << "done" << "\n" ;
    return ;
}
int main()
{
    Ali_Hossam
    findAim() ;
    Ast7mo() ;
}


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST